New MDS or near MDS self-dual codes over finite fields
نویسندگان
چکیده
The study of MDS self-dual codes has attracted lots of attention in recent years. There are many papers on determining existence of q−ary MDS self-dual codes for various lengths. There are not existence of q−ary MDS self-dual codes of some lengths, even these lengths < q. We generalize MDS Euclidean self-dual codes to near MDS Euclidean self-dual codes and near MDS isodual codes. And we obtain many new near MDS isodual codes from extended negacyclic duadic codes and we obtain many new MDS Euclidean self-dual codes from MDS Euclidean self-dual codes. We generalize MDS Hermitian self-dual codes to near MDS Hermitian self-dual codes. We obtain near MDS Hermitian self-dual codes from extended negacyclic duadic codes and from MDS Hermitian self-dual codes.
منابع مشابه
New MDS Self-Dual Codes over Large Finite Fields
We construct MDS Euclidean and Hermitian self-dual codes over large finite fields of odd and even characteristics. Our codes arise from cyclic and negacyclic duadic codes. ∗Faculty of Mathematics USTHB, University of Sciences and Technology of Algiers, B.P 32 El Alia, Bab Ezzouar, Algiers, Algeria
متن کاملNew MDS Euclidean and Hermitian self-dual codes over finite fields
In this paper, we construct MDS Euclidean self-dual codes which are extended cyclic duadic codes. And we obtain many new MDS Euclidean self-dual codes. We also construct MDS Hermitian self-dual codes from generalized Reed-Solomon codes and constacyclic codes. And we give some results on Hermitian self-dual codes, which are the extended cyclic duadic codes.
متن کاملConstruction of MDS self-dual codes from orthogonal matrices
In this paper, we give algorithms and methods of construction of self-dual codes over finite fields using orthogonal matrices. Randomization in the orthogonal group, and code extension are the main tools. Some optimal, almost MDS, and MDS self-dual codes over both small and large prime fields are constructed.
متن کاملMDS and self-dual codes over rings
In this paper we give the structure of constacyclic codes over formal power series and chain rings. We also present necessary and sufficient conditions on the existence of MDS codes over principal ideal rings. These results allow for the construction of infinite families of MDS self-dual codes over finite chain rings, formal power series and principal ideal rings.
متن کاملConstructions of self-dual codes over finite commutative chain rings
We study self-dual codes over chain rings. We describe a technique for constructing new self-dual codes from existing codes and we prove that for chain rings containing an element c with c = −1 all self-dual codes can be constructed by this technique. We extend this construction to self-dual codes over principal ideal rings via the Chinese Remainder Theorem. We use torsion codes to describe the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1609.04602 شماره
صفحات -
تاریخ انتشار 2016